Quantities of points on some Edwards curves

نویسندگان

چکیده

The Edwards curves of the form x2 + y2 = 1 dx2y2 are investigated in this article. An exact formula for quantity points on over a field Fp is obtained odd prime numbers p. special attention paid to with exactly p+1 Fp. These called supersingular. They not recommended usage cryptography, because their structure relatively simple. supersingularity curve proved any p 4m+3. Also, some other values d, which equivalent (mod p) supersingular, found.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Compression for trace zero points on twisted Edwards curves

We propose two optimal representations for the elements of trace zero subgroups of twisted Edwards curves. For both representations, we provide efficient compression and decompression algorithms. The efficiency of the algorithm is compared with the efficiency of similar algorithms on elliptic curves in Weierstrass form.

متن کامل

Differential Addition on Edwards Curves

We give two parametrizations of points on Edwards curves that omit the X coordinate. The first parametrization leads to a differential addition formula that has the cost 5M + 4S, a doubling formula that has the cost 5S and a tripling formula that costs 4M+7S. The second one yields a differential addition formula with cost 5M + 2S and a doubling formula with cost 5S both even on generalized Edwa...

متن کامل

Arithmetic Progressions on Edwards Curves

Several authors have investigated the problem of finding elliptic curves over Q that contain rational points whose x-coordinates are in arithmetic progression. Traditionally, the elliptic curve has been taken in the form of an elliptic cubic or elliptic quartic. Moody studied this question for elliptic curves in Edwards form, and showed that there are infinitely many such curves upon which ther...

متن کامل

Halving on Binary Edwards Curves

Edwards curves have attracted great interest for their efficient addition and doubling formulas. Furthermore, the addition formulas are strongly unified or even complete, i.e., work without change for all inputs. In this paper, we propose the first halving algorithm on binary Edwards curves, which can be used for scalar multiplication. We present a point halving algorithm on binary Edwards curv...

متن کامل

Edwards curves and CM curves

Edwards curves are a particular form of elliptic curves that admit a fast, unified and complete addition law. Relations between Edwards curves and Montgomery curves have already been described. Our work takes the view of parameterizing elliptic curves given by their j-invariant, a problematic that arises from using curves with complex multiplication, for instance. We add to the catalogue the li...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical and applied cybersecurity

سال: 2022

ISSN: ['2664-2913', '2708-1397']

DOI: https://doi.org/10.20535/tacs.2664-29132021.1.251297